Optimal Communication Algorithms for Hypercubes
نویسندگان
چکیده
We consider the following basic communication problems in a hypercube network of processors: the problem of a single processor sending a different packet to each of the other processors, the problem of simultaneous broadcast of the same packet from every processor to all other processors, and the problem of simultaneous exchange of different packets between every pair of processors. The algorithms proposed for these problems are optimal in terms of execution time and communication resource requirements; that is, they require the minimum possible number of time steps and packet transmissions. In contrast, algorithms in the literature are optimal only within an additive or multiplicative factor. @ 1991 Academic Press,lnc.
منابع مشابه
A New Approach For Optimal MIMD Queueless Routing Of Omega and Inverse-Omega Permutations On Hypercubes
Omega permutations constitute the subclass of particular permutations which have gained the more attention in the search of optimal routing of permutations in hypercubes. The reason of this attention comes from the fact that they are permutations for general-purpose computing like the simultaneous conflict-free access to the rows or the columns of a matrix. In this paper we address the problem ...
متن کاملCommunication algorithms for isotropic tasks in hypercubes and wraparound meshes
Varvarigos, E.A. and D.P. Bertsekas, Communication algorithms for isotropic tasks in hypercubes and wraparound meshes, Parallel Computing 18 (1992) 1233-1257. We consider a broad class of communication tasks, which we call isotropic, in a hypercube and in a wraparound mesh of processors. These tasks are characterized by a type of symmetry with respect to origin node. We show that executing such...
متن کاملThe Priority Broadcast Scheme for Dynamic Broadcast in Hypercubes and Related Networks
Dynamic broadcast is a communication problem where each node in a parallel computer generates packets to be broadcast to all the other nodes according to a certain random process. The lower bound on the average time required by any oblivious dynamic broadcast algorithm in an ndimensional hypercube is Ω(n+ 1 1 ρ)when packets are generated according to a Poisson process, where ρ is the load facto...
متن کاملOptimal All-to-Some Personalized Communication on Hypercubes
In a hypercube multiprocessor with distributed memory, each data element has a street address and an apartment number (i.e. a hypercube node address and a local memory address). We describe an optimal algorithm for performing the all-to-some personalized communication (ASPC) on Boolean n-cubes, defined as (ijj) ! (i 2j jj), i 2 [0; 2n 1], j 2 [0; n 1], where (ijj) denote the data element on nod...
متن کاملNovel Data Communication Algorithms on Hypercubes and Related Interconnection Networks and Their Applications in Computational Geometry
We present several novel data communication algorithms for hypercubes. Speci cally, we obtain (1) an algorithm that broadcasts m messages of unit size on a hypercube of size N in optimal time O(m + logN); and (2) algorithms for special cases of computing m pre x sums, also in optimal time O(m + logN). Unlike previous algorithms for performing similar tasks, our schemes require no use of pipelin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Parallel Distrib. Comput.
دوره 11 شماره
صفحات -
تاریخ انتشار 1991